Languages with Bounded Multiparty Communication Complexity ∗ Arkadev Chattopadhyay Andreas Krebs

Source URL: www2.ift.ulaval.ca

A New, Fully Quantum Notion of Information Complexity, and an Application to Direct Sum for Bounded Round Quantum Communication Complexity Dave Touchette 1 We present the first general direct sum theorem for quantum comm

Source URL: www.quantum-lab.org

Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes Yvo Desmedt1,2 Stelios Erotokritou1

Source URL: 2010.africacrypt.com

On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

Source URL: www.complexity.ethz.ch

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Automated theorem proving
• Logic in computer science
• Rules of inference
• Resolution
• Proof complexity
• Conflict-Driven Clause Learning
• Boolean algebra
• Exponential time hypothesis
• PP

Bounds on Tradeos between Randomness and Communication Complexity Ran Canetti Oded Goldreichy August 6, 1990

Source URL: www.wisdom.weizmann.ac.il

Computation Power of Randomization and Nondeterminism 2 Scientific Work

Source URL: www.ite.ethz.ch

• Complexity classes
• Computational complexity theory
• Finite automata
• Models of computation
• Analysis of algorithms
• Nondeterminism
• NL
• Randomized algorithm
• Automata theory
• Theory of computation
• Communication complexity
• NP

Probabilistic Communication Complexity - Foundations of Computer Science, 1984. 25th Annual Symposium on

Source URL: cseweb.ucsd.edu

Restricted Two-Variable FO+MOD Sentences, Circuits and Communication Complexity Pascal Tesson1,
and Denis Th´erien2,

1 D´epartement d’Informatique et de G´enie Logiciel, Universit´e Laval

Source URL: www2.ift.ulaval.ca

New bounds on the classical and quantum communication complexity of some graph properties∗ Gábor Ivanyos1 , Hartmut Klauck2 , Troy Lee3 , Miklos Santha4 , and Ronald de Wolf5 1

Source URL: drops.dagstuhl.de

The Communication Complexity of Distributed Task Allocation Andrew Drucker Fabian Kuhn

Source URL: ac.informatik.uni-freiburg.de